Some Improvements on Kumlander-s Maximum Weight Clique Extraction Algorithm
نویسندگان
چکیده
Some fast exact algorithms for the maximum weight clique problem have been proposed. Östergård’s algorithm is one of them. Kumlander says his algorithm is faster than it. But we confirmed that the straightforwardly implemented Kumlander’s algorithm is slower than Östergård’s algorithm. We propose some improvements on Kumlander’s algorithm. Keywords—Maximum weight clique, exact algorithm, branch-andbound, NP-hard.
منابع مشابه
Improving the Maximum-Weight Clique Algorithm for the Dense Graphs
In this paper we present a fast algorithm for the maximum-weight clique problem on arbitrary undirected graphs, which is improved for the dense graphs. The algorithm uses colour classes and backtracking techniques inside itself in parallel in a form of a branch and bound algorithm. The algorithm contains also several improvements for the most complex case, which are dense graphs. Computational ...
متن کاملA new exact algorithm for the maximum-weight clique problem based on a heuristic vertex-coloring and a backtrack search
In this paper we present an exact algorithm for the maximum-weight clique problem on arbitrary undirected graphs. The algorithm based on a fact that vertices from the same independent set couldn’t be included into the same maximum clique. Those independent sets are obtained from a heuristic vertex coloring where each of them is a color class. Color classes and a backtrack search are used for pr...
متن کاملArtificial Intelligence in the Maximum Clique Finding Problem Applications
In this paper we propose collecting different maximum clique finding algorithms into a metaalgorithm, which enables to solve this NP-hard problem much more efficiently. We provide guidelines on how this intelligent meta-algorithm can be built, what information is needed from the maximum clique finding point of view and propose an elementary structure of it. Besides we review a test environment ...
متن کاملComparing the Best Maximum Clique Finding Algorithms, Which are Using Heuristic Vertex Colouring
In this paper two best known at the moment algorithms for finding the maximum clique is compared. A key technique that both algorithms rely on is using a heuristic vertex colouring. The only difference between those algorithms is a way of using vertex-colouring and this difference in the very important. The algorithms’ approaches are divided in this paper into two classes: reapplying vertex col...
متن کاملApplying AI and Incomplete Solution Principles to Solve NP-hard Problems in the Real-Time Systems
In this paper a question of using artificial intelligence principles and an incomplete solution approach were explored for solving NP hard problems in the real-time systems using the maximum clique finding problem as an example. The incomplete solution is used to analyze different best known algorithms in the real-time environment, while artificial intelligence principles were implemented in a ...
متن کامل